TRIGONOMETRIC QUASI - GREEDY BASES FOR L p ( T ; w )
نویسنده
چکیده
? Users may download and print one copy of any publication from the public portal for the purpose of private study or research. ? You may not further distribute the material or use it for any profit-making activity or commercial gain ? You may freely distribute the URL identifying the publication in the public portal ? Take down policy If you believe that this document breaches copyright please contact us at [email protected] providing details, and we will remove access to the work immediately and investigate your claim.
منابع مشابه
TRIGONOMETRIC QUASI-GREEDY BASES FOR L(T;w)
Let B = {en}n∈N be a bounded Schauder basis for a Banach space X, i.e., a basis for which 0 < infn ‖en‖X ≤ supn ‖en‖X < ∞. An approximation algorithm associated with B is a sequence {An}n=1 of (possibly nonlinear) maps An : X → X such that for x ∈ X, An(x) is a linear combination of at most n elements from B. We say that the algorithm is convergent if limn→∞ ‖x−An(x)‖X = 0 for every x ∈ X. For ...
متن کاملLebesgue-type Inequalities for Quasi-greedy Bases
We show that for quasi-greedy bases in real or complex Banach spaces the error of the thresholding greedy algorithm of order N is bounded by the best N term error of approximation times a function of N which depends on the democracy functions and the quasi-greedy constant of the basis. If the basis is democratic this function is bounded by C logN . We show with two examples that this bound is a...
متن کاملOn the Existence of Almost Greedy Bases in Banach Spaces
We consider several greedy conditions for bases in Banach spaces that arise naturally in the study of the Thresholding Greedy Algorithm (TGA). In particular, we continue the study of almost greedy bases begun in [3]. We show that almost greedy bases are essentially optimal for n-term approximation when the TGA is modified to include a Chebyshev approximation. We prove that if a Banach space X h...
متن کاملGreedy and Quasi-greedy Expansions in Non-integer Bases
We generalize several theorems of Rényi, Parry, Daróczy and Kátai by characterizing the greedy and quasi-greedy expansions in non-integer bases.
متن کاملDemocratic systems of translates
Democratic systems arise in the context of greedy approximations in Banach spaces. The greedy algorithm is an important method in numerical mathematics; for more details see the early work of V. N. Temlyakov [16], [17]. At the same time it also points to some interesting issues in functional analysis. In particular, we would like to emphasize the basic theorem of S. V. Konyagin and V. N. Temlya...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006